


def one_is_equal():
	"""
	算法复杂度为O(n^2)
	"""
	x1 = 'earth'
	y1 = 'heart'
	if len(x1) == len(y1) and all([i for i in list(x1) if i in list(y1)]):
		return True
	return False

def two_is_equal():
	"""算法复杂度为O(n^2)"""
	x1 = 'earth'
	y1 = 'heart'
	if list(x1).sort() == list(y1).sort():
		return True
	return False



if __name__ == "__main__":
	res = two_is_equal()
	print('x1 and y1 is change_pos_word.') if res else print('x1 and y1 not is change_pos_word.')